Determining maximum k-width-connectivity on meshes
نویسندگان
چکیده
منابع مشابه
Determining Maximum k-Width-Connectivity on Meshes
Let I be a n n binary image stored in a n n mesh of processors with one pixel per processor. Image I is k-width-connected if, informally, between any pair of 1-pixels there exists a path of width k (composed of 1-pixels only). We consider the problem of determining the largest integer k such that I is k-width-connected, and present an optimal O(n) time algorithm for the mesh architecture.
متن کاملDetermining Maximum itk-Width Connectivity on Meshes
Let I be a n n binary image stored in a n n mesh of processors with one pixel per processor. Image I is k-width-connected if, informally, between any pair of 1-pixels there exists a path of width k (composed of 1-pixels only). We consider the problem of determining the largest integer k such that I is k-width-connected, and present an optimal O(n) time algorithm for the mesh architecture.
متن کاملToughness of the Networks with Maximum Connectivity
The stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. As the network begins losing links or nodes, eventually there is a loss in its effectiveness. Thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...
متن کاملTricyclic and Tetracyclic Graphs with Maximum and Minimum Eccentric Connectivity
Let $G$ be a connected graph on $n$ vertices. $G$ is called tricyclic if it has $n + 2$ edges, and tetracyclic if $G$ has exactly $n + 3$ edges. Suppose $mathcal{C}_n$ and $mathcal{D}_n$ denote the set of all tricyclic and tetracyclic $n-$vertex graphs, respectively. The aim of this paper is to calculate the minimum and maximum of eccentric connectivity index in $mathcal{C}_n$ and $mathcal{D}_n...
متن کاملtoughness of the networks with maximum connectivity
the stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. as the network begins losing links or nodes, eventually there is a loss in its effectiveness. thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1993
ISSN: 0925-7721
DOI: 10.1016/0925-7721(93)90002-n